#include <stdio.h>

long res[100];

long fib(int n){
    if(n == 1 || n == 2){
        res[n] = 1;
        return res[n];
    }
    res[n] = fib(n - 1) + fib(n - 2);
    return res[n];
}

int main(){
    int n = 10;
    fib(n);
    for (int i = 1; i < n; ++i) {
        printf("%d ",res[i]);
    }
    return 0;
}